Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data

Learnability of Pregroup Grammars p. 65 A Markovian Approach to the Induction of Regular String Distributions p. 77 Learning Node Selecting Tree Transducer from Completely Annotated Examples p. 91 Identifying Clusters from Positive Data p. 103 Introducing Domain and Typing Bias in Automata Inference p. 115 Analogical Equations in Sequences: Definition and Resolution p. 127 Representing Languages by Learnable Rewriting Systems p. 139 A Divide-and-Conquer Approach to Acquire Syntactic Categories p. 151 Grammatical Inference Using Suffix Trees p. 163 Learning Stochastic Finite Automata p. 175 Navigation Pattern Discovery Using Grammatical Inference p. 187 A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure Grammar p. 199